Binary programming: A decision rule for selecting optimal vs heuristic techniques
نویسندگان
چکیده
منابع مشابه
A Linear Programming Heuristic for Optimal Planning
I introduce a new search heuristic for propositional STRIPS planning that is based on transforming planning instances to linear programming instances. The linear programming heuristic is admissible for finding minimum length plans and can be used by partial-order planning algorithms. This heuristic appears to be the first non-trivial admissible heuristic for partial-order planning. An empirical...
متن کاملStep decision rules for multistage stochastic programming: A heuristic approach
Stochastic programming with step decision rules, SPSDR, is an attempt to overcome the curse of computational complexity of multistage stochastic programming problems. SPSDR combines several techniques. The first idea is to work with independent experts. Each expert is confronted with a sample of scenarios drawn at random from the original stochastic process. The second idea is to have each expe...
متن کاملSelecting the Optimal Rule Set Using a Bacterial Evolutionary Algorithm
In many regression learning algorithms for fuzzy rule bases it is not possible to define the error measure to be optimized freely. A possible alternative is the usage of global optimization algorithms like genetic programming approaches. These approaches, however, are very slow because of the high complexity of the search space. In this paper we present a novel approach where we first create a ...
متن کاملHeuristic Dynamic Programming Nonlinear Optimal Controller
This chapter is concerned with the application of approximate dynamic programming techniques (ADP) to solve for the value function, and hence the optimal control policy, in discrete-time nonlinear optimal control problems having continuous state and action spaces. ADP is a reinforcement learning approach (Sutton & Barto, 1998) based on adaptive critics (Barto et al., 1983), (Widrow et al., 1973...
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1973
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/16.2.135